#include<bits/stdc++.h>
using namespace std;
int main(){
int t;
cin>>t;
while(t--){
int x,y,n;
cin>>x>>y>>n;
vector<int> a(n,0);
a[n-1]=y;a[0]=x;
for(int i=1;i<n-1;i++){
a[n-i-1]=a[n-i]-i;
}
if(a[1]-a[0]>n-2){
for (int i = 0; i < n; ++i)
{
cout<<a[i]<<" ";
}cout<<endl;
}else{
cout<<-1<<endl;
}
}
return 0;
}
Teddy and Tweety | Partitioning binary strings |
Special sets | Smallest chosen word |
Going to office | Color the boxes |
Missing numbers | Maximum sum |
13 Reasons Why | Friend's Relationship |
Health of a person | Divisibility |
A. Movement | Numbers in a matrix |
Sequences | Split houses |
Divisible | Three primes |
Coprimes | Cost of balloons |
One String No Trouble | Help Jarvis! |
Lift queries | Goki and his breakup |
Ali and Helping innocent people | Book of Potion making |
Duration | Birthday Party |
e-maze-in | Bricks Game |